Unifying mesh- and tree-based programmable interconnect
نویسندگان
چکیده
منابع مشابه
Interconnect Estimation for Mesh-Based Reconfigurable Computing
The paper presents a new stochastic model for mesh-based reconfigurable computing. Under the conditions of several statistical assumptions, closed formulae of probability and mathematical expectation are derived for each type of connections. Both the theoretical deduction and simulation results are given to verify our approach. The elementary research can be applied to implement and optimize th...
متن کاملMEMS-Based Capacitor Arrays for Programmable Interconnect and RF Applications
We describe a programmable capacitor technology under development at NCSU and its potential application in building programmable interconnect devices useful for system level connectivity functions, phased array beam steering, and RF switching. Crossbars are made from arrays of electrostatically controlled bistable MEMS-based capacitors. These new devices allow faster signaling and consume less ...
متن کاملTesting programmable interconnect systems: an algorithmic approach
This paper presents an approach for fault detection in programmable wiring networks (P WNs). A comprehensive fault model which includes faults in the nets (open, stuck-at and short) as well as in the switches (stuck-off, stuck-on, programming fault), i s assumed at physical and behavioral levels. I n a PWN, the most important issue is to f i nd the minimal number of configurations (or programmi...
متن کاملUnifying Parsimonious Tree Reconciliation
Evolution is a process that is influenced by various environmental factors, e.g. the interactions between different species, genes, and biogeographical properties. Hence, it is interesting to study the combined evolutionary history of multiple species, their genes, and the environment they live in. A common approach to address this research problem is to describe each individual evolution as a ...
متن کاملUnifying Tree-Decomposition Schemes
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas, such as join-tree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. Subsequently, the paper extends the variable-elimination scheme called bucket-elimination (BE) into a two-phase message passing along a bucket-tree (BTE), mak...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 2004
ISSN: 1063-8210,1557-9999
DOI: 10.1109/tvlsi.2004.834237